A fresh approach to evaluate performance in distributed parallel genetic algorithms

نویسندگان

چکیده

This work proposes a novel approach to evaluate and analyze the behavior of multi-population parallel genetic algorithms (PGAs) when running on cluster multi-core processors. In particular, we deeply study their numerical computational by proposing mathematical model representing observed performance curves. them, discuss emerging descriptions PGA instead of, e.g., individual isolated results subject visual inspection, for better understanding effects number cores used (scalability), migration policy (the gap, in this paper), features solved problem (type encoding size). The conclusions based real figures models fitting them represent fresh way speed-up, time, effort, allowing comparison few meaningful numeric parameters. represents set beyond usual textual lessons found past works PGAs. It can be as an estimation tool future finding out upper limit if increases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Parallel Genetic Algorithms on Distributed Memory Architectures

The Genetic Algorithms draw a similarity from the Genetic mutation and Cross Over within populations from biology. The genetic algorithms are highly parallel in nature. These can be used to solve many important problems like Graph Partitioning, Travelling salesman problems, 0-1 Integer linear programming problem etc. When these are implemented, there exists a trade-off between Genetic search qu...

متن کامل

A survey of parallel distributed genetic algorithms

In this work we review the most important existing developments and future trends in the class of Parallel Genetic Algorithms (PGAs). PGAs are mainly subdivided into coarse and fine grain PGAs, the coarse grain models being the most popular ones. An exceptional characteristic of PGAs is that they are not just the parallel version of a sequential algorithm intended to provide speed gains. Instea...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

Julia: A fresh approach to parallel programming

The Julia programming language is gaining enormous popularity. Julia was designed to be easy and fast. Most importantly, Julia shatters deeply established notions widely held in the applied community: 1) High-level, dynamic code has to be slow by some sort of law of nature; 2) It is sensible to prototype in one language and then recode in another language for speed or deployment; and 3) There a...

متن کامل

Parallel Genetic Algorithms with Distributed Panmictic Populations

Genetic algorithms (GAs) are commonly parallelized using multiple communicating populations or by keeping one population and dividing the task of evaluating the tness among several processors. This paper examines an algorithm where the population is physically distributed, but behaves like a single panmictic unit. This is a desirable property because much more is known about single-population G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Soft Computing

سال: 2022

ISSN: ['1568-4946', '1872-9681']

DOI: https://doi.org/10.1016/j.asoc.2022.108540